Перевод: со всех языков на все языки

со всех языков на все языки

set of formulas

См. также в других словарях:

  • set theory — the branch of mathematics that deals with relations between sets. [1940 45] * * * Branch of mathematics that deals with the properties of sets. It is most valuable as applied to other areas of mathematics, which borrow from and adapt its… …   Universalium

  • Formulas — Formula For mu*la, n.; pl. E. {Formulas}, L. {Formul[ae]}. [L., dim. of forma form, model. See{Form}, n.] 1. A prescribed or set form; an established rule; a fixed or conventional method in which anything is to be done, arranged, or said. [1913… …   The Collaborative International Dictionary of English

  • formulas — for·mu·la || fÉ”rmjÉ™lÉ™ / mjÊŠl n. set way of saying or doing something; mixture fed to a baby in place of mother s milk; recipe …   English contemporary dictionary

  • Positive set theory — In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension* {x mid phi} exists holds for at least the positive formulas phi (the smallest class of formulas containing atomic… …   Wikipedia

  • CLASSIC WESTERN FORMULAS —    The Great Train Robbery (1903), along with early popular novels such as Owen Wister’s The Virginian (1902), quickly established the basic formulas for classic Westerns. Since the beginning, cinema Westerns, like popular Western novels, have… …   Westerns in Cinema

  • Ackermann set theory — is a version of axiomatic set theory proposed by Wilhelm Ackermann in 1956. The languageAckermann set theory is formulated in first order logic. The language L A consists of one binary relation in and one constant V (Ackermann used a predicate M… …   Wikipedia

  • Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only …   Wikipedia

  • Answer set programming — (ASP) is a form of declarative programming oriented towards difficult (primarily NP hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models …   Wikipedia

  • Transitive set — In set theory, a set (or class) A is transitive, if * whenever x ∈ A , and y ∈ x , then y ∈ A , or, equivalently, * whenever x ∈ A , and x is not an urelement, then x is a subset of A .The transitive closure of a set A is the smallest (with… …   Wikipedia

  • Useful conversions and formulas for air dispersion modeling — Various governmental agencies involved with environmental protection and with occupational safety and health have promulgated regulations limiting the allowable concentrations of gaseous pollutants in the ambient air or in emissions to the… …   Wikipedia

  • List of price index formulas — A number of different formulas, at least hundreds, have been proposed as means of calculating price indexes. While price index formulas all use price and quantity data, they amalgamate this data in different ways. A price index generally… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»